Extending possibilistic logic over Gödel logic

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending possibilistic logic over Gödel logic

In this paper we present several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Gödel logic formulas. Based on different characterizations of necessity measures on fuzzy sets, a group of logics with Kripke style semantics are built over a restricted language, namely a two level language composed of non-modal and modal formulas, the latter ...

متن کامل

Extending possibilistic logic over Godel logic

In this paper we present several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Godel logic formulas. Based on different characterizations of necessity measures on fuzzy sets, a group of logics with Kripke style semantics are built over a restricted language, namely a two level language composed of nonmodal and modal formulas, the latter m...

متن کامل

Exploring Extensions of Possibilistic Logic over Gödel Logic

In this paper we present completeness results of several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Gödel logic formulas. In a first attempt, based on different characterizations of necessity measures on fuzzy sets, a group of logics, with Kripke style semantics, are built over a restricted language, indeed a two level language compose...

متن کامل

Extending Answer Set Programming using Generalized Possibilistic Logic

Answer set programming (ASP) is a form of logic programming in which negation-as-failure is defined in a purely declarative way, based on the notion of a stable model. This short paper briefly explains how a recent generalization of possibilistic logic (GPL) can be used to characterize the semantics of answer set programming. This characterization has several advantages over existing characteri...

متن کامل

Extending Description Logics with Uncertainty Reasoning in Possibilistic Logic

Possibilistic logic provides a convenient tool for dealing with inconsistency and handling uncertainty. In this paper, we propose possibilistic description logics as an extension of description logics. We give semantics and syntax of possibilistic description logics. We then define two inference services in possibilistic description logics. Since possibilistic inference suffers from the drownin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Approximate Reasoning

سال: 2011

ISSN: 0888-613X

DOI: 10.1016/j.ijar.2010.08.014